Scheduling Hard Real-time Tasks with Precedence Constraints on Multiprocessor Systems
نویسندگان
چکیده
In this paper, a scheduling algorithm based on deadline time and precedence constraints was developed to schedule hard real-time tasks on multiprocessor systems. The real-time tasks are characterized by their arrival time, deadline time, computation time and precedence constraints. Scheduling problem for these tasks has been solved to determine the order of scheduling tasks on the processors to minimize the overall computation time, and obtain speeding up. The effectiveness of the developed algorithm is shown through a simulation study.
منابع مشابه
Static multiprocessor scheduling of periodic real-time tasks with precedence constraints and communication costs
The problem of allocating and scheduling realtime tasks, with Precedence Constraints and Communication Costs, on a multiprocessor architecture in order to meet the timing constraints is known to be NP-complete. Due to the growing complexity of real-time applications there is a need to find scheduling methods that can handle large task sets in a reasonable time. Also, scheduling methods should c...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملIncluding Selective Fault - Tolerance inReal - Time Multiprocessor Schedules 1
An increasing number of applications are demanding real-time performance from their multiprocessor systems. For many of these applications, a failure may produce disastrous results. However, the area of fault-tolerant hard real-time multiprocessor scheduling has scarcely been investigated. Consider fault-tolerant static scheduling of tasks of varying degrees of criticality on a multiprocessor s...
متن کاملPC-Fair: Fair Scheduling of Precedence-Constrained Periodic Tasks in Multiprocessor Systems
The Pfair scheduling algorithms are known to be optimal for scheduling periodic real-time tasks on multiprocessor systems. However, one of the limitations of most prior work on the Pfair scheduling is that precedence constraints among tasks are not considered. We thus propose a PC-Fair (PrecedenceConstrained Fair) scheduling algorithm to overcome this limitation. The novelty of our algorithm co...
متن کاملSynthesis of Hard Real-Time Application Specific Systems
This paper presents a system level approach for the synthesis of hard real-time multitask application specific systems. The algorithm takes into account task precedence constraints among multiple hard real-time tasks and targets a multiprocessor system consisting of a set of heterogeneous off-the-shelf processors. The optimization goal is to select a minimal cost multi-subset of processors whil...
متن کامل